The Oriented Graph Complexes
نویسندگان
چکیده
منابع مشابه
Graph Complexes
This is a note from T. Willwacher’s lecture series which was part of masterclass “Algebraic structure of Hochschild complexes” at the University of Copenhagen in October 2015. From the course description: Graph complexes are differential graded vector spaces whose elements are linear combinations of combinatorial graphs. The differential is the operation of contracting an edge. These graph comp...
متن کاملOPTIMALIZATION PHASE USING GRAPH MODELLING FOR RELIABLE BUILDING COMPLEXES
During the planning phase of modern, complex, block-structured, large-area located, but still landscape-harmonized health-care buildings, the key is the optimal positioning of the blocks and functions, simultaneously ensuring the most-effective backup-paths for any transportation route failure in the buildings in order to speed up system operation, reduce maintenance costs and especially to imp...
متن کاملOriented graph coloring
An oriented k-coloring of an oriented graph G (that is a digraph with no cycle of length 2) is a partition of its vertex set into k subsets such that (i) no two adjacent vertices belong to the same subset and (ii) all the arcs between any two subsets have the same direction. We survey the main results that have been obtained on oriented graph colorings.
متن کاملThe Hull Number of an Oriented Graph
We present characterizations of connected graphs G of order n ≥ 2 for which h + (G) = n. It is shown that for every two integers n and m with 1 ≤ n − 1 ≤ m ≤ n 2 , there exists a connected graph G of order n and size m such that for each integer k with 2 ≤ k ≤ n, there exists an orientation of G with hull number k. 1. Introduction. The (directed) distance d(u, v) from a vertex u to a vertex v i...
متن کاملOriented Bipartite Graphs and the Goldbach Graph
In this paper we study oriented bipartite graphs. In particular, several characterizations of bitournaments are obtained. We introduce the concept of odd-even graphs and show that any (oriented) bipartite graph can be represented by some (oriented) odd-even graph. We show that the famous Goldbach’s conjecture is equivalent to the connectedness of certain odd-even graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Mathematical Physics
سال: 2014
ISSN: 0010-3616,1432-0916
DOI: 10.1007/s00220-014-2168-9